Game Theory Based False Negative Probability of Embedded Watermark Under Unintentional and Steganalysis Attacks

Steganalysis attack is to statistically estimate the embedded watermark in the watermarked multimedia,and the estimated watermark may be destroyed by the attacker.The existing methods of false negative probability,however,do not consider the influence of steganalysis attack.This paper proposed the game theory based false negative probability to estimate the impacts of steganalysis attack,as well as unintentional attack.Specifically,game theory was used to model the collision between the embedment and steganalysis attack,and derive the optimal building embedding/attacking strategy.Such optimal playing strategies devote to calculating the attacker destructed watermark,used for calculation of the game theory based false negative probability.The experimental results show that watermark detection reliability measured using our proposed method,in comparison,can better reflect the real scenario in which the embedded watermark undergoes unintentional attack and the attacker using steganalysis attack.This paper provides a foundation for investigating countermeasures of digital watermarking community against steganalysis attack.     

Modern breaking of Enigma ciphertexts

“Breaking German Army Ciphers” is the title of a Cryptologia article from 2005, describing the lucky survival of several hundred authentic Enigma messages of World War II, and an account of a ciphertext-only cryptanalysis of a large number of these messages, leaving only a few (mostly short messages) unbroken. After reviewing the work done, and investigating the reasons for both lucky breaks and close misses, the modern ciphertext-only attack on Enigma messages is improved, especially on genuine ones with short lengths and/or many garbles. The difficulties of a proper measure for the candidate’s closeness to a plaintext are clarified. The influence on the decryption process of an empty plugboard and one with only a few correct plugs is examined. The method is extended by a partial exhaustion of the plugboard combined with an optimized hillclimbing strategy. The newly designed software succeeds in breaking formerly unbroken messages.     

基于不可靠通信链路的数据共享模块

随着企业规模的逐步扩大和计算机网络与企业信息技术的飞速发展，大中型企业陆续建立了很多业务系统，对各个系统之间数据同步的安全性提出了更高的需求。针对此需求，基于RabbitMQ消息队列中间件，本文设计并实现基于不可靠通信链路的数据共享模块，解决在企业内部两级数据中心之间的双向数据同步问题，并通过RabbitMQ的消息确认机制和持久化机制，保证数据的安全送达、无丢失。经过实践证明，该数据共享模块功能稳定，可提高两级数据中心的数据传输效率并保证其安全性。     

A New NTRU-Type Public-Key Cryptosystem over the Binary Field

As the development of cloud computing and the convenience of wireless sensor netowrks, smart devices are widely used in daily life, but the security issues of the smart devices have not been well resolved. In this paper, we present a new NTRU-type public-key cryptosystem over the binary field. Specifically, the security of our scheme relies on the computational intractability of an unbalanced sparse polynomial ratio problem (DUSPR). Through theoretical analysis, we prove the correctness of our proposed cryptosystem. Furthermore, we implement our scheme using the NTL library, and conduct a group of experiments to evaluate the capabilities and consuming time of encryption and decryption. Our experiments result demonstrates that the NTRU-type public-key cryptosystem over the binary field is relatively practical and effective.     

Digital Document Signing: Vulnerabilities and Solutions

ABSTRACT

Digital signature is the key issue in a number of innovative processes, such as dematerialization, e-government, e-commerce, and e-banking. Digital signature ensures both the identity of the user and the integrity of the digital document the user signs. However, despite the robustness of the underlying cryptographic primitives, a number of vulnerabilities derive from the radical difference between handwritten signature on papers and signature on digital documents. Indeed, digital documents are not directly observable because humans need a tool to interpret the bits of the document and to represent the corresponding information. The aim of this paper is to focus on the vulnerabilities of digital signature deriving from the “unobservability” of electronic documents. Possible mechanisms to contrast such vulnerabilities are also proposed, highlighting their positive and negative points under a perspective that does not ignore both practical and regulatory aspects.     

Structural robustness of city road networks based on community

Road network robustness is the ability of a road network to operate correctly under a wide range of attacks. A structural robustness analysis can describe the survivability of a city road network that is under attack and can help improve functions such as urban planning and emergency response. In this paper, a novel approach is presented to quantitatively evaluate road network robustness based on the community structure derived from a city road network, in which communities refer to those densely connected subsets of nodes that are sparsely linked to the remaining network. First, a road network is reconstructed into a set of connected communities. Then, successive simulated attacks are conducted on the reconstructed road networks to test the performance of the networks under attack. The performance of the networks is represented by efficiency and the occurrence of fragmentation. Three attack strategies, including a random attack and two intentional attacks, are performed to evaluate the survivability of the road network under different situations. Contrary to the traditional road segment-based approach, the community-based robustness analysis on a city road network shows distinct structural diversity between communities, providing greater insight into network vulnerability under intentional attacks. Six typical city road networks on three different continents are used to demonstrate the proposed approach. The evaluation results reveal an important feature of the structure of city road networks from a community-based perspective, i.e., that the structure is robust under random failure but fragile under intentional attack. This result is highly consistent in different city road network forms.     

On designing an unaided authentication service with threat detection and leakage control for defeating opportunistic adversaries

Unaided authentication services provide the flexibility to login without being dependent on any additional device. The power of recording attack resilient unaided authentication services (RARUAS) is undeniable as, in some aspects, they are even capable of offering better security than the biometric based authentication systems. However, high login complexity of these RARUAS makes them far from usable in practice. The adopted information leakage control strategies have often been identified as the primary cause behind such high login complexities. Though recent proposals havemade some significant efforts in designing a usable RARUAS by reducing its login complexity, most of them have failed to achieve the desired usability standard. In this paper, we have introduced a new notion of controlling the information leakage rate. By maintaining a good security standard, the introduced idea helps to reduce the login complexity of our proposed mechanism − named as Textual-Graphical Password-based Mechanism or TGPM, by a significant extent. Along with resisting the recording attack, TGPM also achieves a remarkable property of threat detection. To the best of our knowledge, TGPM is the first RARUAS, which can both prevent and detect the activities of the opportunistic recording attackers who can record the complete login activity of a genuine user for a few login sessions. Our study reveals that TGPM assures much higher session resiliency compared to the existing authentication services, having the same or even higher login complexities. Moreover, TGPM stores the password information in a distributed way and thus restricts the adversaries to learn the complete secret from a single compromised server. A thorough theoretical analysis has been performed to prove the strength of our proposal from both the security and usability perspectives. We have also conducted an experimental study to support the theoretical argument made on the usability standard of TGPM.     

非点对点消息网间互联互通技术方案

介绍了我国开放非点对点消息网间互联互通的背景,并分阶段对我国实现非点对点消息网间互联互通的技术方案进行了介绍和分析。     

一种MAC漂移检测功能的实现与应用

提出一种MAC漂移检测功能，该功能对端口间的MAC漂移进行实时统计，并根据统计结果作出适当处理，可以有效解决这一问题，并在多种实用场景中发挥重要作用。     

Phishing attacks discovery based on HTML layout similarity

Based on the similarity of the layout structure between the phishing sites and real sites,an approach to discover phishing sites was presented.First,the tag with link attribute as a feature was extracted,and then based on the feature,the page tag sequence branch to identify website was extracted,followed by the page layout similarity-HTMLTagAntiPhish,the alignment of page tag sequence tree into the alignment of page tag sequence branches was converted,this converted two-dimention tree structure into one-dimention string structure,and finally through the substitution matrix of bioinfor-matics BLOSUM62 coding,alignment score quickly to improve the phishing sites detection efficiency was computed.A series of simulation experiments show that this approach is feasible and has higher precision and recall rates.